ON THE WARING–GOLDBACH PROBLEM WITH ALMOST EQUAL SUMMANDS
نویسندگان
چکیده
منابع مشابه
Multivariate Compounds with Equal Number of Summands
The paper considers multivariate discrete random sums with equal number of summands. Such distributions describe the total claim amount received by a company in a fixed time point. In Queuing theory they characterize cumulative waiting times of customers up to time t. In Theory of branching processes they model the number of heirs at a fixed point in time. Here some general properties and formu...
متن کاملOn the Directed Oberwolfach Problem with Equal Cycle Lengths
We examine the necessary and sufficient conditions for a complete symmetric digraph K n to admit a resolvable decomposition into directed cycles of length m. We give a complete solution for even m, and a partial solution for odd m.
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملRANKING DMUS ON THE BENCHMARK LINE WITH EQUAL SHADOW PRICES
Data envelopment analysis (DEA) with considering the best condition for each decision making unit (DMU) assesses the relative efficiency for it and divides a homogenous group of DMUs in to two categories: efficient and inefficient, but traditional DEA models can not rank efficient DMUs. Although some models were introduced for ranking efficient DMUs, Franklin Lio & Hsuan peng (2008), proposed a...
متن کاملOn Sums of Powers of Almost Equal Primes
We investigate the Waring-Goldbach problem of representing a positive integer n as the sum of s kth powers of almost equal prime numbers. Define sk = 2k(k − 1) when k > 3, and put s2 = 6. In addition, put θ2 = 19 24 , θ3 = 4 5 and θk = 5 6 (k > 4). Suppose that n satisfies the necessary congruence conditions, and put X = (n/s). We show that whenever s > sk and ε > 0, and n is sufficiently large...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2020
ISSN: 0025-5793,2041-7942
DOI: 10.1112/mtk.12019